Image Operations using a Semi-compressed Contour Tree Image Definition
نویسنده
چکیده
The contour tree file format has been used for a few years as a suitable storage format for most image types. The technique stores unique regions into a hierarchical data structure which defines the complete raster image. This data structure is called a contour tree. It compares very favourable with other lossless coding schemes on all image format types including, bi-level and reduced colour images as well as true 24-bit colour images. Being developed is a toolkit of image manipulators that operate on an intermediate contour tree file format directly. This means operations can be potentially carried out at the complexity of the contour tree rather than proportional to the number of pixels in the full raster image. Also operations can be compression conscious, which means that they continually have an idea of the final compression ratio achievable. The design of a semi-compressed contour tree data structure is a key component. This structure is both relatively easy to apply certain image operations to, and also easy to convert to the low level contour tree description. Image operations including cleaning an image, reducing its resolution both in bits per pixel and in raster size, and in resizing the image after decoding, have been developed. Sample command line code translators from other popular file formats along with further details are available. This can be found on (http:// www.dmu.ac.uk/-mt/) the World Wide Web or via electronic mail from the main author ([email protected]).
منابع مشابه
The contour tree image encoding technique and file format
The process of contourization is presented which converts a raster image into a discrete set of plateaux or contours . These contours can be grouped into a hierarchical structure, defining total spatial inclusion, called a contour tree. A contour coder has been developed which fully describes these contours in a compact and efficient manner and is the basis for an image compression method. Simp...
متن کاملCompressed Image Hashing using Minimum Magnitude CSLBP
Image hashing allows compression, enhancement or other signal processing operations on digital images which are usually acceptable manipulations. Whereas, cryptographic hash functions are very sensitive to even single bit changes in image. Image hashing is a sum of important quality features in quantized form. In this paper, we proposed a novel image hashing algorithm for authentication which i...
متن کاملSemantic-Based Image Retrial in the VQ Compressed Domain using Image Annotation Statistical Models
متن کامل
Image Retrieval Using Dynamic Weighting of Compressed High Level Features Framework with LER Matrix
In this article, a fabulous method for database retrieval is proposed. The multi-resolution modified wavelet transform for each of image is computed and the standard deviation and average are utilized as the textural features. Then, the proposed modified bit-based color histogram and edge detectors were utilized to define the high level features. A feedback-based dynamic weighting of shap...
متن کاملSingular Value Decomposition based Steganography Technique for JPEG2000 Compressed Images
In this paper, a steganography technique for JPEG2000 compressed images using singular value decomposition in wavelet transform domain is proposed. In this technique, DWT is applied on the cover image to get wavelet coefficients and SVD is applied on these wavelet coefficients to get the singular values. Then secret data is embedded into these singular values using scaling factor. Different com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996